基于DID模型的ITS对北京交通拥堵改善的研究:评价期的视角

采用双重差分模型,基于智能交通系统(ITS)效用发挥滞后时间为3年,选择2010年和2014年作为评价时点对ITS实施效果和北京交通拥堵之间的相关性进行分析.DID模型计量分析的最终结果显示,ITS效果的发挥明显改善了北京交通拥堵问题.为了验证评价结果的可信度,通过改变评价时点这一参数对评价结果进行稳健性检验,结果仍显示ITS效应发挥对北京交通拥堵改善有很大的促进作用.     

A dissipation‐free numerical method to solve one‐dimensional hyperbolic flow equations

In this paper, a numerical method to capture the shock wave propagation in 1‐dimensional fluid flow problems with 0 numerical dissipation is presented. Instead of using a traditional discrete grid, the new numerical method is built on a range‐discrete grid, which is obtained by a direct subdivision of values around the shock area. The range discrete grid consists of 2 types: continuous points and shock points. Numerical solution is achieved by tracking characteristics and shocks for the movements of continuous and shock points, respectively. Shocks can be generated or eliminated when triggering entropy conditions in a marking step. The method is conservative and total variation diminishing. We apply this new method to several examples, including solving Burgers equation for aerodynamics, Buckley‐Leverett equation for fractional flow in porous media, and the classical traffic flow. The solutions were verified against analytical solutions under simple conditions. Comparisons with several other traditional methods showed that the new method achieves a higher accuracy in capturing the shock while using much less grid number. The new method can serve as a fast tool to assess the shock wave propagation in various flow problems with good accuracy.     

Two-worker blocking congestion model with walk speed m in a no-passing circular passage system

This paper introduces a blocking model and closed-form expression of two workers traveling with walk speed m (m = integer) in a no-passing circular-passage system of n stations and assuming n = m + 2, 2m + 2, …. We develop a Discrete-Timed Markov Chain (DTMC) model to capture the workers’ changes of walk, pick, and blocked states, and quantify the throughput loss from blocking congestion by deriving a steady state probability in a closed-form expression. We validate the model with a simulation study. Additional simulation comparisons show that the proposed throughput model gives a good approximation of a general-sized system of n stations (i.e., n > 2), a practical walk speed system of real number m (i.e., m ? 1), and a bucket brigade order picking application.     

A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks

A G‐design of order n is a decomposition of the complete graph on n vertices into edge‐disjoint subgraphs isomorphic to G. Grooming uniform all‐to‐all traffic in optical ring networks with grooming ratio C requires the determination of graph decompositions of the complete graph on n vertices into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The existence spectrum problem of G‐designs for five‐vertex graphs is a long standing problem posed by Bermond, Huang, Rosa and Sotteau in 1980, which is closely related to traffic groomings in optical networks. Although considerable progress has been made over the past 30 years, the existence problems for such G‐designs and their related traffic groomings in optical networks are far from complete. In this paper, we first give a complete solution to this spectrum problem for five‐vertex graphs by eliminating all the undetermined possible exceptions. Then, we determine almost completely the minimum drop cost of 8‐groomings for all orders n by reducing the 37 possible exceptions to 8. Finally, we show the minimum possible drop cost of 9‐groomings for all orders n is realizable with 14 exceptions and 12 possible exceptions.     

Optimal Groomings with Grooming Ratios Six and Seven

Grooming uniform all‐to‐all traffic in optical (SONET) rings with grooming ratio C requires the determination of a decomposition of the complete graph into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The determination of optimal C‐groomings has been considered for , and completely solved for . For , it has been shown that the lower bound for the drop cost of an optimal C‐grooming can be attained for almost all orders with 5 exceptions and 308 possible exceptions. For , there are infinitely many unsettled orders; especially the case is far from complete. In this paper, we show that the lower bound for the drop cost of a 6‐grooming can be attained for almost all orders by reducing the 308 possible exceptions to 3, and that the lower bound for the drop cost of a 7‐grooming can be attained for almost all orders with seven exceptions and 16 possible exceptions. Moreover, for the unsettled orders, we give upper bounds for the minimum drop costs.     

Influence of the automotive Start/Stop system on noise emission: Experimental study

One of the most common environmental impacts of road transportation is the traffic noise. Linked to this, Start/Stop is a technology which has demonstrated to save fuel by powering off the engine when the vehicle is stopped, such as in front of a traffic light, and restarting the engine instantly when the driver pushes back the pedal brake to proceed. The technology helps also to reduce the CO₂ emission, playing a key role in a way to accomplish stringent emission norms for vehicle manufacturer. However, we are not sure whether it reduces the noise emission and how much? Thus, the main aim of this work is to assess the engine noise emissions of a vehicle incorporating a Start/Stop system in urban traffic, and compare it with those radiated by the mean traffic stream. Experimental results demonstrate that there are no contributions of the Start/Stop system to reduce meaningfully the engine noise in urban traffic.     

The time-dependent Ginzburg-Landau equation for the two-velocity difference model

A thermodynamic theory is formulated to describe the phase transition and critical phenomenon in traffic flow.Based on the two-velocity difference model,the time-dependent Ginzburg-Landau (TDGL) equation under certain condition is derived to describe the traffic flow near the critical point through the nonlinear analytical method.The corresponding two solutions,the uniform and the kink solutions,are given.The coexisting curve,spinodal line and critical point are obtained by the first and second derivatives of the thermodynamic potential.The modified Korteweg de Vries (mKdV) equation around the critical point is derived by using the reductive perturbation method and its kink-antikink solution is also obtained.The relation between the TDGL equation and the mKdV equation is shown.The simulation result is consistent with the nonlinear analytical result.     

基于出行目的链的出行生成—分布组合模型分析

目前,我国城市轨道交通客流预测大多采用交通产生、吸引、出行分布、出行方式划分四阶段模型,其中出行生成与分布是方式划分和交通分配的前提,是模型重要的组成部分.在对传统的四阶段模型的分析基础上,结合非集计模型的优点,论文提出了基于出行目的链的出行生成—分布组合模型.模型充分考虑了居民出行链、出行目的等对客流预测的影响,在完善我国轨道交通客流预测理论和方法,提高预测精度等方面具有一定的理论价值和实际意义.